Single-Layer Trunk Routing Using Minimal 45-Degree Lines
نویسندگان
چکیده
منابع مشابه
Single-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing
In recent Printed Circuit Boards (PCB), the design size and density have increased, and the improvement of routing tools for PCB is required. Although there are several routing tools that generate high-quality global routings when only horizontal and vertical segments are used, PCB designers are not satisfied with these tools because high-density PCBs require segments that have arbitrary direct...
متن کاملSingle phase three-layer channel routing algorithms
We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...
متن کاملMinimum Separation for Single-Layer Channel Routing
We provide a linear-time algorithm for determining the minimum separation required to route a channel when the connections can be realized in one layer. Differing from the usual “river-routing” context, we allow single-sided connections. The algorithm also works directly for problems with multiterminal nets and does not require wires to lie on an underlying grid, though it does use the rectilin...
متن کاملSingle-layer wire routing and compaction
No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading single layer wire routing and compaction is also a way as one of the collective books that gives many advantages. The advantages...
متن کاملParallel Algorithms for Single-Layer Channel Routing
We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have lineartime sequential solutions rather than limiting attention to the “river-routing” context, where single-sided connections are disallowed. For the minimum separation problem, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2011
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e94.a.2510